A unified analysis of global EDF and fixed-task-priority schedulability of sporadic task systems on multiprocessors
نویسندگان
چکیده
Fixed-task-priority (FTP) scheduling and earliest-deadline-first (EDF) scheduling policies are alike in fixing the priority of each job of a task at the time the job is released. This common feature of FTP and EDF scheduling permits a unified analysis of scheduling failures, to derive new sufficient tests for meeting all deadlines of a set of independent sporadic tasks under a global preemptive FTP or EDF scheduling policy. The performance of the new tests has been evaluated in comparison to prior schedulability tests, by simulation. The new tests are able to verify some schedulable task systems that could not be verified by prior tests, but also fail to verify some systems that can be verified by prior analysis techniques. The biggest gain appears to be for fixed-task-priority scheduling, especially with post-period deadlines.
منابع مشابه
Multiprocessor Schedulability Analysis for Self - Suspending Task Systems ∗
In many real-time systems, tasks may experience suspension delays. The problem of analyzing task systems with such suspensions on multiprocessors has been relatively unexplored and is thought to be difficult (as it is on uniprocessors). In this paper, hard/soft multiprocessor schedulability tests for arbitrary-deadline sporadic self-suspending task systems are presented for both global EDF and ...
متن کاملSuspension-Aware Schedulability Analysis for Multiprocessor Embedded Systems
In many embedded systems, tasks may experience suspension delays. The problem of analyzing task systems with such suspensions on multiprocessors has been relatively unexplored. The commonly used suspension-oblivious approach of treating all suspensions as computation can be quite pessimistic. As an alternative, this paper presents the first suspension-aware multiprocessor schedulability analysi...
متن کاملGlobal EDF-based scheduling with laxity-driven priority promotion
This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for scheduling sporadic task systems on multiprocessors. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm. Each job is assigned a priority based on the well-known Global Earliest Deadline First (G-EDF) algorithm, as long as its laxity – the amount of time from the earliest possible time ...
متن کاملNew Schedulability Tests for Real-Time Task Sets Scheduled by Deadline Monotonic on Multiprocessors
In this paper, we address the problem of schedulability analysis of a set of real-time periodic (or sporadic) tasks on multiprocessor hardware platforms, under fixed priority global scheduling. In a multiprocessor system with M processors, a global scheduler consists of a single queue of ready tasks for all processors, and the scheduler selects the first M tasks to execute on the M processors. ...
متن کاملReal-Time Scheduling on Uni- and Multiprocessors based on Priority Promotions
This paper addresses the problem of real-time scheduling of a set of sporadic tasks on uniand multiprocessor platform based on priority promotion. A new preemptive scheduling algorithm, called Fixed-Priority with Priority Promotion (FPP), is proposed. In FPP scheduling, tasks are executed similar to traditional fixed-priority (FP) scheduling but the priority of some tasks are promoted at fixed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Embedded Computing
دوره 4 شماره
صفحات -
تاریخ انتشار 2011